Skew Chromatic Index of Circular Ladder Graphs
نویسندگان
چکیده
Abstract. A skew edge coloring of a graph G is defined to be a set of two edge colorings such that no two edges are assigned the same unordered pair of colors. The skew chromatic index s(G) is the minimum number of colors required for a skew edge coloring of G. In this paper, an algorithm is determined for skew edge coloring of circular ladder graphs. Alsothe skew chromatic index of circular ladder graphs is solved in polynomial time.
منابع مشابه
Skew Chromatic Index of Certain Classes of Graphs
A skew edge coloring of a graph G is defined to be a set of two edge colorings such that no two edges are assigned the same unordered pair of colors. The skew chromatic index s(G) is the minimum number of colors required for a skew edge coloring of G. In this paper, skew edge coloring of certain classes of graphs are determined. Furthermore, the skew chromatic index of those graphs is obtained ...
متن کاملChromatic Harmonic Indices and Chromatic Harmonic Polynomials of Certain Graphs
In the main this paper introduces the concept of chromatic harmonic polynomials denoted, $H^chi(G,x)$ and chromatic harmonic indices denoted, $H^chi(G)$ of a graph $G$. The new concept is then applied to finding explicit formula for the minimum (maximum) chromatic harmonic polynomials and the minimum (maximum) chromatic harmonic index of certain graphs. It is also applied to split graphs and ce...
متن کاملAsymptotic Lower Bounds on Circular Chromatic Index of Snarks
We prove that the circular chromatic index of a cubic graph G with 2k vertices and chromatic index 4 is at least 3 + 2/k. This bound is (asymptotically) optimal for an infinite class of cubic graphs containing bridges. We also show that the constant 2 in the above bound can be increased for graphs with larger girth or higher connectivity. In particular, if G has girth at least 5, its circular c...
متن کاملChromatic Equivalence of Generalized Ladder Graphs
A class of graphs called generalized ladder graphs is defined. A sufficient condition for pairs of these graphs to be chromatically equivalent is proven. In addition a formula for the chromatic polynomial of a graph of this type is proven. Finally, the chromatic polynomials of special cases of these graphs are explicitly computed.
متن کاملThe circular chromatic index of graphs of high girth
We show that for each ε > 0 and each integer ∆ ≥ 1, there exists a number g such that for any graph G of maximum degree ∆ and girth at least g, the circular chromatic index of G is at most ∆ + ε.
متن کامل